Successful Performance via Decision Generalisation in No Limit Texas Hold'em

نویسندگان

  • Jonathan Rubin
  • Ian D. Watson
چکیده

Given a set of data, recorded by observing the decisions of an expert player, we present a case-based framework that allows the successful generalisation of those decisions in the game of no limit Texas Hold’em. The transition from a limit betting structure to a no limit betting structure offers challenging problems that are not faced in the limit domain. In particular, we address the problems of determining a suitable action abstraction and the resulting state translation that is required to map real-value bet amounts into a discrete set of abstract actions. We also detail the similarity metrics used in order to identify similar scenarios, without which no generalisation of playing decisions would be possible. We show that we were able to successfully generalise no limit betting decisions from recorded data via our agent, SartreNL, which achieved a 2nd place finish at the 2010 Annual Computer Poker Competition.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Decision Generalisation from Game Logs in No Limit Texas Hold'em

Given a set of data, recorded by observing the decisions of an expert player, we present a case-based framework that allows the successful generalisation of those decisions in the game of no limit Texas Hold’em. We address the problems of determining a suitable action abstraction and the resulting state translation that is required to map real-value bet amounts into a discrete set of abstract a...

متن کامل

Algorithms for Evolving No-Limit Texas Hold'em Poker Playing Agents

Computers have difficulty learning how to play Texas Hold’em Poker. The game contains a high degree of stochasticity, hidden information, and opponents that are deliberately trying to mis-represent their current state. Poker has a much larger game space than classic parlour games such as Chess and Backgammon. Evolutionary methods have been shown to find relatively good results in large state sp...

متن کامل

A Heuristic-Based Approach for a Betting Strategy in Texas Hold'em Poker

Artificial intelligence research in Texas Hold’em poker has recently mainly focused on heads-up fixed limit game. Game theoretic methods used in the poker agents capable of playing at the very best level are not easily generalized to other forms of Texas Hold’em poker. In this paper we present a general approach to build a poker agent, where the betting strategy is defined by estimating the exp...

متن کامل

Computing an approximate jam/fold equilibrium for 3-player no-limit Texas Hold'em tournaments

A recent paper computes near-optimal strategies for twoplayer no-limit Texas hold’em tournaments; however, the techniques used are unable to compute equilibrium strategies for tournaments with more than two players. Motivated by the widespread popularity of multiplayer tournaments and the observation that jam/fold strategies are nearoptimal in the two player case, we develop an algorithm that c...

متن کامل

GS3 and Tartanian: game theory-based heads-up limit and no-limit Texas Hold'em poker-playing programs

We demonstrate two game theory-based programs for headsup limit and no-limit Texas Hold’em poker. The first player, GS3, is designed for playing limit Texas Hold’em, in which all bets are a fixed amount. The second player, Tartanian, is designed for the no-limit variant of the game, in which the amount bet can be any amount up to the number of chips the player has. Both GS3 and Tartanian are ba...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011